One Diophantine inequality with integer and prime variables
نویسندگان
چکیده
*Correspondence: [email protected] 2Department of Mathematics and Information Science, Henan University of Economics and Law, Zhengzhou, 450046, P.R. China Full list of author information is available at the end of the article Abstract In this paper, we show that if λ1, λ2, λ3, λ4 are positive real numbers, at least one of the ratios λi/λj (1≤ i < j≤ 4) is irrational, then the inequality |λ1x2 1 + λ2x 2 + λ3x 3 + λ4x 4 – p – 2 | < 2 has infinite solutions with natural numbers x1, x2, x3, x4 and prime p. MSC: 11D75; 11P55
منابع مشابه
Diophantine m-tuples for primes
In this paper, we show that if p is a prime and ifA = {a1, a2, . . . , am} is a set of positive integers with the property that aiaj +p is a perfect square for all 1 ≤ i < j ≤ m, then m < 3 · 2168. More generally, when p is replaced by a squarefree integer n, the inequality m ≤ f(ω(n)) holds with some function f , where ω(n) is the number of prime divisors of n. We also give upper bounds for m ...
متن کاملOn the Diophantine equation q n − 1 q − 1 = y
There exist many results about the Diophantine equation (qn − 1)/(q − 1) = ym, where m ≥ 2 and n ≥ 3. In this paper, we suppose that m = 1, n is an odd integer and q a power of a prime number. Also let y be an integer such that the number of prime divisors of y − 1 is less than or equal to 3. Then we solve completely the Diophantine equation (qn − 1)/(q − 1) = y for infinitely many values of y....
متن کاملOn the Frobenius Number of a Modular Diophantine Inequality
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality ax mod b 6 x, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
متن کاملIntroduction to Diophantine Approximation
In this article we formalize some results of Diophantine approximation, i.e. the approximation of an irrational number by rationals. A typical example is finding an integer solution (x, y) of the inequality |xθ − y| ¬ 1/x, where θ is a real number. First, we formalize some lemmas about continued fractions. Then we prove that the inequality has infinitely many solutions by continued fractions. F...
متن کاملAsymptotic Estimates for the Number of Integer Solutions to Decomposable Form Inequalities
For homogeneous decomposable forms F (X) in n variables with integer coefficients, we consider the number of integer solutions x ∈ Zn to the inequality |F (x)| ≤ m as m → ∞. We give asymptotic estimates which improve on those given previously by the author in [T1]. Here our error terms display desirable behaviour as a function of the height whenever the degree of the form and the number of vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015